基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于扩展Petri网的动态服务聚合流程描述模型及其BPEL4WS表示方法

针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。     

石英角速率传感器数字相关检测技术研究

为提高石英角速率传感器(QRS)的测量性能,提出了基于数字相关检测技术的QRS信号解调方案。该方案需将一组互相正交的参考信号作为两个相关器的输入,能够同时分离出QRS敏感信号相对于参考信号的同相分量和正交分量。通过角速度提取算法可由以上分量进一步得到输入角速度。分析了实现参考通道功能的两种方法:锁相环(PLL)和Hilbert变换,通过对这两种方法的对比得知,PLL更适合作为QRS相关检测的参考通道。     

高功率UWB天线阵及其在外场探测中的应用

运用切割式巴仑实现高功率超宽带天线的平衡馈电,并用FDTD进行仿真分析。研制出2×4元高功率天线阵,测量结果显示该天线阵能耐250kV以上高压,工作带宽达6个倍频(200～12 000MHz),具有较好的脉冲波形保真性。利用所研制的天线阵列建立外场探测实验系统,在外场进行目标探测试验。结果表明该天线阵可以用于实际的超宽带雷达发射天线阵,为高功率源在雷达探测中的应用作出了初步探索。     

机动目标跟踪误差CRLB计算与分析

克拉美-罗下限(CRLB)作为参数估计所能达到的最低误差限,常被用来衡量算法估计性能的优劣程度。以转弯机动为例,研究了有源(主动)和无源(被动)两种观测条件下目标跟踪CRLB计算的一般方法,并通过矩阵理论分析了目标机动可能引起的CRLB突变的原因,为机动目标跟踪的算法性能评估提供了有效手段。最后给出了仿真算例。     

甲板坐标系下速率火控射击诸元解算及弹道修正

速率火控系统是在甲板坐标系下解相遇的,它不依赖于导航系统.它与常规火控不同,甲板倾斜的修正不能采用简单的坐标系变换的方式.针对速率火控甲板倾斜修正问题,指出了两种需要进行甲板倾斜修正的情况,推导给出了计算方法,通过原理仿真计算,验证了计算方法的正确性.     

对辐射源信号到达角的自适应跟踪估计

为提高信号到达角(AOA)的测量精度,采用修正的窗函数加权平均算法和基于机动加速度的非零均值时间相关模型的自适应卡尔曼滤波算法,将信号到达角的变化轨迹看作是一种做加速度机动的运动,实现对连续变化信号到达角的参数估计.计算机仿真验证了算法的有效性和可行性,证明该方法有一定的应用价值.     

现代高层建筑消防安全探讨

针对高层建筑的特点及消防安全现状,在分析高层建筑火灾危险性和危害性的基础上,提出保证高层建筑消防安全需要进行全面的系统设计、实施全方位的科学管理、健全法规、加强各方面的综合协调,并对防范火灾发生、控制火灾扩大、确保安全疏散等问题进行了探讨。